Perfect Colorings of the Infinite Square Grid: Coverings and Twin Colors

نویسندگان

چکیده

A perfect coloring (equivalent concepts are equitable partition and design) of a graph $G$ is function $f$ from the set vertices onto some finite (of colors) such that every node color $i$ has exactly $S(i,j)$ neighbors $j$, where constants, forming matrix $S$ called quotient. If an adjacency simple $T$ on colors, then covering target by cover $G$. We characterize all coverings infinite square grid, proving either orbit (that is, corresponds to under action group automorphisms) or twin colors two unifying them keeps perfect). The case separately classified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

متن کامل

Twin edge colorings of certain square graphs and product graphs

A twin edge k-coloring of a graph G is a proper edge k-coloring of G with the elements of Zk so that the induced vertex k-coloring, in which the color of a vertex v in G is the sum in Zk of the colors of the edges incident with v, is a proper vertex k-coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Twin chromatic index of the square P 2 n ...

متن کامل

On locally-perfect colorings

A (proper) coloring of a finite simple graph (G) is pe#ect if it uses exactly o(G) colors, where o(G) denotes the order of a largest clique in G. A coloring is locally-perfect [3] if it induces on the neighborhood of every vertex v a perfect coloring of this neighborhood. A graph G is perfect (resp. locally-petfect) if every induced subgraph admits a perfect (resp. locally-perfect) coloring. Pr...

متن کامل

Square-free colorings of graphs

Let G be a graph and let c be a coloring of its edges. If the sequence of colors along a walk of G is of the form a1, . . . , an, a1, . . . , an, the walk is called a square walk. We say that the coloring c is squarefree if any open walk is not a square and call the minimum number of colors needed so that G has a square-free coloring a walk Thue number and denote it by πw(G). This concept is a ...

متن کامل

Infinite Petri Nets: Part 1, Modeling Square Grid Structures

A composition and analysis technique was developed for investigation of infinite Petri nets with regular structure, introduced for modeling networks, clusters and computing grids, that also concerns cellular automata and biological systems. A case study of a square grid structure composition and analysis is presented. Parametric description of Petri nets, parametric representation of infinite s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2023

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/10005